| 1. |
- Eslami Kiasari, Abbas, et al.
(författare)
-
A Framework for Designing Congestion-Aware Deterministic Routing
- 2010
-
Ingår i: NoCArc '10 Proceedings of the Third International Workshop on Network on Chip Architectures. - New York, NY, USA : ACM. - 9781450303972 ; , s. 45-50
-
Konferensbidrag (refereegranskat)abstract
- In this paper, we present a system-level Congestion-Aware Routing (CAR) framework for designing minimal deterministic routing algorithms. CAR exploits the peculiarities of the application workload to spread the load evenly across the network. To this end, we first formulate an optimization problem of minimizing the level of congestion in the network and then use the simulated annealing heuristic to solve this problem. The proposed framework assures deadlock-free routing, even in the networks without virtual channels. Experiments with both synthetic and realistic workloads show the effectiveness of the CAR framework. Results show that maximum sustainable throughput of the network is improved by up to 205% for different applications and architectures.
|
|
| 2. |
- Eslami Kiasari, Abbas, et al.
(författare)
-
A Heuristic Framework for Designing and Exploring Deterministic Routing Algorithm for NoCs
- 2013
-
Ingår i: Algorithms in Networks-on-Chip. - New York, NY : Springer. - 9781461482734 ; , s. 21-39
-
Bokkapitel (refereegranskat)abstract
- In this chapter, we present a system-level framework for designing minimal deterministic routing algorithms for Networks-on-Chip (NoCs) that are customized for a set of applications. To this end, we first formulate an optimization problem of minimizing average packet latency in the network and then use the simulated annealing heuristic to solve this problem. To estimate the average packet latency we use a queueing-based analytical model which can capture the burstiness of the traffic. The proposed framework does not require virtual channels to guarantee deadlock freedom since routes are extracted from an acyclic channel dependency graph. Experiments with both synthetic and realistic workloads show the effectiveness of the approach. Results show that maximum sustainable throughput of the network is improved for different applications and architectures.
|
|
| 3. |
- Eslami Kiasari, Abbas, et al.
(författare)
-
An Analytical Latency Model for Networks-on-Chip
- 2013
-
Ingår i: IEEE Transactions on Very Large Scale Integration (vlsi) Systems. - 1063-8210 .- 1557-9999. ; 21:1, s. 113-123
-
Tidskriftsartikel (refereegranskat)abstract
- We propose an analytical model based on queueing theory for delay analysis in a wormhole-switched network-on-chip (NoC). The proposed model takes as input an application communication graph, a topology graph, a mapping vector, and a routing matrix, and estimates average packet latency and router blocking time. It works for arbitrary network topology with deterministic routing under arbitrary traffic patterns. This model can estimate per-flow average latency accurately and quickly, thus enabling fast design space exploration of various design parameters in NoC designs. Experimental results show that the proposed analytical model can predict the average packet latency more than four orders of magnitude faster than an accurate simulation, while the computation error is less than 10% in non-saturated networks for different system-on-chip platforms.
|
|
| 4. |
- Eslami Kiasari, Abbas, et al.
(författare)
-
Analytical approaches for performance evaluation of networks-on-chip
- 2012
-
Ingår i: CASES'12 - Proceedings of the 2012 ACM International Conference on Compilers, Architectures and Synthesis for Embedded Systems, Co-located with ESWEEK. - New York, NY, USA : ACM. - 9781450314244 ; , s. 211-212
-
Konferensbidrag (refereegranskat)abstract
- This tutorial reviews four popular mathematical formalisms - dataflow analysis, schedulability analysis, network calculus, and queueing theory - and how they have been applied to the analysis of Network-on-Chip (NoC) performance. We review the basic concepts and results of each formalism and provide examples of how they have been used in on-chip communication performance analysis. The tutorial also discusses the respective strengths and weaknesses of each formalism, their suitability for a specific purpose, and the attempts that have been made to bridge these analytical approaches. Finally, we conclude the tutorial by discussing open research issues.
|
|
| 5. |
- Eslami Kiasari, Abbas, et al.
(författare)
-
Mathematical formalisms for performance evaluation of networks-on-chip
- 2013
-
Ingår i: ACM Computing Surveys. - : Association for Computing Machinery (ACM). - 0360-0300 .- 1557-7341. ; 45:3, s. 38-
-
Tidskriftsartikel (refereegranskat)abstract
- This article reviews four popular mathematical formalisms-queueing theory, network calculus, schedulability analysis, anddataflow analysis-and how they have been applied to the analysis of on-chip communication performance in Systems-on-Chip. The article discusses the basic concepts and results of each formalism and provides examples of how they have been used in Networks-on-Chip (NoCs) performance analysis. Also, the respective strengths and weaknesses of each technique and its suitability for a specific purpose are investigated. An open research issue is a unified analytical model for a comprehensive performance evaluation of NoCs. To this end, this article reviews the attempts that have been made to bridge these formalisms.
|
|
